Solving 7x7 Hex: Virtual Connections and Game-State Reduction
نویسندگان
چکیده
We present an algorithm which determines the outcome of an arbitrary Hex game-state by finding a winning virtual connection for the winning player. Our algorithm performs a recursive descent search of the game-tree, combining fixed and dynamic game-state virtual connection composition rules with some new Hex game-state reduction results based on move domination. The algorithm is powerful enough to solve arbitrary 7 7 game-states; in particular, we use it to determine the outcome of a 7 7 Hex game after each of the 49 possible opening moves, in each case finding an explicit proof-tree for the winning player.
منابع مشابه
Solving 7 7 Hex: Virtual Connections and Game-state Reduction
We present an algorithm which determines the outcome of an arbitrary Hex game-state by finding a winning virtual connection for the winning player. Our algorithm performs a recursive descent search of the game-tree, combining fixed and dynamic game-state virtual connection composition rules with some new Hex game-state reduction results based on move domination. The algorithm is powerful enough...
متن کاملA New Solution for 7x7 Hex Game
Abstract. In this paper, we applied the decomposition method to obtain a new winning strategy for 7x7 Hex game. We also find that some positions on the 7x7 Hex board, which are called “trivial positions”, were never occupied by Black among all of strategies in the new solution. In other words, Black can still win the game by using the strategies described in this paper even if White already has...
متن کاملA Move Generating Algorithm for Hex Solvers
Generating good move orderings when searching for solutions to games can greatly increase the efficiency of game solving searches. This paper proposes a move generating algorithm for the board game called Hex, which in contrast to many other approaches, determines move orderings from knowledge gained during the search. This move generator has been used in Hex searches solving the 6x6 Hex board ...
متن کاملAn Extension of the H-Search Algorithm for Artificial Hex Players
Hex is a classic board game invented in the middle of the twentieth century by Piet Hein and rediscovered later by John Nash. The best Hex artificial players analyse the board positions by deducing complex virtual connections from elementary connections using the H-Search algorithm. In this paper, we extend the H-search with a new deduction rule. This new deduction rule is capable of discoverin...
متن کاملHexGraph: Applying Graph Drawing Algorithms to the Game of Hex
Hex is a classic board game for two players. There exists an intuitive mapping of the state of a hex game onto a graph. The motivation of the work presented in this paper was to create a new user interface paradigm for playing Hex, which is based on the graph representation of the state of the game, and which increases the player’s ability to find good moves/strategies. The paradigm uses graph ...
متن کامل